A tighter bounding interval for the 1-chromatic number of a surface
نویسندگان
چکیده
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
a time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Bounding the Fractional Chromatic Number of KDelta-Free Graphs
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maximum degree ∆ has fractional chromatic number at most ∆− 2 67 unless it is isomorphic to C5 K2 or C 8 . Using a different approach we give improved bounds for ∆ ≥ 6 and pose several related conjectures. Our proof relies on a weighted local generalization of the fractional relaxation of Reed’s ω, ∆, χ conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00335-t